Symmetric Volatile Shared Key Encryption: A Two-way Communication Shared Key Encryption
نویسندگان
چکیده
منابع مشابه
Big-Key Symmetric Encryption: Resisting Key Exfiltration
This paper aims to move research in the bounded retrieval model (BRM) from theory to practice by considering symmetric (rather than public-key) encryption, giving efficient schemes, and providing security analyses with sharp, concrete bounds. The threat addressed is malware that aims to exfiltrate a user’s key. Our schemes aim to thwart this by using an enormously long key, yet paying for this ...
متن کاملAn Efficient Public Key Encryption Scheme Using Shared Secrets
This paper describes the combination of Shamir secret sharing method with the trap door characteristics of discrete logarithm mod a large prime number as employed in the Diffie-Hellman exchange scheme. The purpose of this combination is to protect the privacy of the numbers held by the parties of the shared secret, while at the same time authorizing them to broadcast data in the clear which whe...
متن کاملTree based symmetric key broadcast encryption
The most influential broadcast encryption (BE) scheme till date was introduced in 2001 by Naor, Naor and Lotspiech (NNL) and is based on binary trees. This paper generalizes the ideas of NNL to obtain BE schemes based on k-ary trees for any k ≥ 2. The treatment is uniform across all k and essentially provides a single scheme which is parameterized by the arity of the underlying tree. We perform...
متن کاملShared Key Encryption by the State Machine with Two-Dimensional Random Look-up Table
This paper describes a new approach to creation of fast encryption methods with symmetric (shared) key. The result solution is intermediate one between block and stream ciphers. The main advantages of both types of ciphers are realized, while most of disadvantages are eliminated. The new approach combines encryption with built-in calculation of the hash for the data integrity, pseudo-random gen...
متن کاملAnonymity in shared symmetric key primitives
We provide a stronger definition of anonymity in the context of shared symmetric key primitives, and show that existing schemes do not provide this level of anonymity. A new scheme is presented to share symmetric key operations amongst a set of participants according to a (t, n)-threshold access structure. We quantify the amount of information the output of the shared operation provides about t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics and Computer Science
سال: 2017
ISSN: 2575-6036
DOI: 10.11648/j.mcs.20170203.11